package binarySearch;

public class Demo {
    //二分查找前提 数组为有序 没找到返回-1s
    public int search(int[] nums,int target){
        int left = 0,right = nums.length-1;

        while(left <= right){
            int mid = (left + right)/2;
            if (nums[mid] == target){
                return nums[mid];
            }else if(nums[mid] > target){
                left = mid+1;
            }else if(nums[mid] < target){
                right = mid-1;
            }
        }
        return -1;
    }
}
